package com.mtons.datastructure.tree.binarytree;

public interface Tree {

    public BinaryNode find(int key);

    public boolean insert(int key);

    // 中序遍历
    public void infixOrder(BinaryNode current);

    // 前序遍历
    public void preOrder(BinaryNode current);

    // 后序遍历
    public void postOrder(BinaryNode current);

    // 查找最大值
    public BinaryNode findMax();

    // 查找最小值
    public BinaryNode findMin();

    public boolean delete(int key);
}
